A Nonzero Complex Sequence with Vanishing Power-Sums
نویسندگان
چکیده
منابع مشابه
Generalized Coiflets with Nonzero-Centered Vanishing Moments
We show that imposing a certain number of vanishing moments on a scaling function (e.g., coiflets) leads to fairly small phase distortion on its associated filter bank in the neighborhood of DC. However, the phase distortion at the other frequencies can be much larger. We design a new class of real-valued, compactly supported, orthonormal, and nearly symmetric wavelets (we call them generalized...
متن کاملVanishing Polynomial Sums
with unknown xi. In 1769 Euler conjectured that (1.1) has no positive integral solutions when m < n. This generalizes both his result for n1⁄4 3 and Fermat’s Last Theorem. However his conjecture was refuted for mþ 11⁄4 n1⁄4 5 (Lander and Parkin, 1966) and then for mþ 11⁄4 n1⁄4 4 (Elkies, 1988). It is still unknown whether (1.1) has solutions with mþ 11⁄4 n 6 or with m1⁄4 31⁄4 n 2. On the other ...
متن کاملTernary Codes Associated with O(3,3^r) and Power Moments of Kloosterman Sums with Trace Nonzero Square Arguments
Abstract. In this paper, we construct two ternary linear codes C(SO(3, q)) and C(O(3, q)), respectively associated with the orthogonal groups SO(3, q) and O(3, q). Here q is a power of three. Then we obtain two recursive formulas for the power moments of Kloosterman sums with “trace nonzero square arguments” in terms of the frequencies of weights in the codes. This is done via Pless power momen...
متن کاملMinimal Vanishing Sums of Roots of Unity with Large Coefficients
A vanishing sum a0 + a1ζn + . . .+ an−1ζ n−1 n = 0 where ζn is a primitive n-th root of unity and the ai’s are nonnegative integers is called minimal if the coefficient vector (a0, . . . , an−1) does not properly dominate the coefficient vector of any other such nonzero sum. We show that for every c ∈ N there is a minimal vanishing sum of n-th roots of unity whose greatest coefficient is equal ...
متن کاملOn Vanishing Sums of Roots of Unity
Consider the m-th roots of unity in C, where m > 0 is an integer. We address the following question: For what values of n can one find n such m-th roots of unity (with repetitions allowed) adding up to zero? We prove that the answer is exactly the set of linear combinations with non-negative integer coefficients of the prime factors of m.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1990
ISSN: 0002-9939
DOI: 10.2307/2047952